Symmetric Blind Decryption with Perfect Secrecy
نویسندگان
چکیده
منابع مشابه
Symmetric Blind Decryption with Perfect Secrecy
A blind decryption scheme enables a user to query decryptions from a decryption server without revealing information about the plaintext message. Such schemes are useful, for example, for the implementation of privacy preserving encrypted file storages and payment systems. In terms of functionality, blind decryption is close to oblivious transfer. For noiseless channels, information-theoretical...
متن کاملPerfect Secrecy and Statistical
There are two key properties of the above. First, given only c, Eve should not be able to learn what m is. Second, Dec(Enc(m)) = m, so that Bob can accurately determine the message that Alice wanted to send. Creating functions Enc and Dec which satisfy this is a fundamental problem of cryptography. But given the above encryption scheme, knowing what these functions are is enough for anyone to d...
متن کاملOn Symmetric Encryption with Distinguishable Decryption Failures
We propose to relax the assumption that decryption failures are indistinguishable in security models for symmetric encryption. Our main purpose is to build models that better reflect the reality of cryptographic implementations, and to surface the security issues that arise from doing so. We systematically explore the consequences of this relaxation, with some surprising consequences for our un...
متن کاملSecure Blind Decryption
In this work we construct public key encryption schemes that admit a protocol for blindly decrypting ciphertexts. In a blind decryption protocol, a user with a ciphertext interacts with a secret keyholder such that the user obtains the decryption of the ciphertext and the keyholder learns nothing about what it decrypted. While we are not the first to consider this problem, previous works provid...
متن کاملPerfect Secrecy and Adversarial Indistinguishability
Claude Shannon introduced an entropy model for information, and applied it to secrecy in communications. It supposes a source of information, Alice, which chooses among a set of possible messages. There is associated with this choice a likelihood that Alice would chose a particular message. Symbols are then sent across a channel to Bob. These symbols should refine Bob’s likelihood function, emp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Networks and Communications
سال: 2017
ISSN: 2090-7141,2090-715X
DOI: 10.1155/2017/6575907